Lifecycle-Aware Online Video Caching
نویسندگان
چکیده
The current explosion of video traffic compels service providers to deploy caches at edge networks. Nowadays, most caching systems store data with a high programming voltage corresponding the largest possible ‘expiry date’, typically on order years, which maximizes cache damage. However, popular videos rarely exhibit lifecycles longer than couple months. Consequently, can instead be adapted fit lifecycle and mitigate damage accordingly. In this paper, we propose LiA-cache, Lifecycle-Aware policy for online videos. LiA-cache finds both near-optimal retention times eviction policies by optimizing delivery cost conjointly. We first investigate temporal patterns access from real-world dataset covering 10 million collected one mobile network operators in world. next cluster based their integrate clustering into general model system. Specifically, analyzes them depending label. Compared other scenarios, reduce up 90 perce, while keeping hit ratio close purely relying popularity.
منابع مشابه
Quality-Aware Cooperative Proxy Caching for Video Streaming Services
By applying a proxy mechanism widely used in WWW systems to video streaming systems, low-delay and high-quality video distribution can be accomplished without imposing extra load on the system. The video streaming system proposed in this paper consists of a video server and multiple proxy servers. In our mechanism, proxies communicate with each other and retrieve missing video data from an appr...
متن کاملCaching Eliminates the Wireless Bottleneck in Video-Aware Wireless Networks
Cellular data traffic almost doubles every year, greatly straining network capacity. The main driver for this development is wireless video. Traditional methods for capacity increase (like using more spectrum and increasing base station density) are very costly, and do not exploit the unique features of video, in particular a high degree of asynchronous content reuse. In this paper we give an o...
متن کاملOnline Compression Caching
Motivated by the possibility of storing a file in a compressed format, we formulate the following class of compression caching problems. We are given a cache with a specified capacity, a certain number of compression/uncompression algorithms, and a set of files, each of which can be cached as it is or by applying one of the compression algorithms. Each compressed format of a file is specified b...
متن کاملOnline Companion Caching
This paper is concerned with online caching algorithms for the (n, k)-companion cache, defined by Brehob et. al. [3]. In this model the cache is composed of two components: a k-way set-associative cache and a companion fully-associative cache of size n. We show that the deterministic competitive ratio for this problem is (n+1)(k+1)−1, and the randomized competitive ratio is O(log n log k) and Ω...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Mobile Computing
سال: 2021
ISSN: ['2161-9875', '1536-1233', '1558-0660']
DOI: https://doi.org/10.1109/tmc.2020.2984364